Modified Pixel Sieve Method for Visual Cryptography
نویسندگان
چکیده
Visual cryptography encodes a secret image into n shares which are distributed to n participants. Pixel Sieve method was proposed recently to encode an image into shares, but the encryption quality is poor. In this paper an modified version of pixel sieve method is proposed to achieve more security than existing pixel sieve method. Based on key shifting scheme, the proposed method generates quite noisy and highly secure encrypted images. The simulation shows that the quality of the encrypted images observably better than existing pixel sieve method.
منابع مشابه
An Improved Pixel Sieve Method for Visual Cryptography
Visual cryptography encodes a secret image into n shares which are distributed to n participants. Pixel Sieve method was proposed recently to encode an image into shares, but the encryption quality is poor. In this paper an improved version of pixel sieve method is proposed to achieve more security then existing pixel sieve method. Based on cross merge and key shifting schemes, the proposed met...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملImproved Algorithm for Visual Cryptography Using Region Incrementation
1 Region incrementing visual cryptography is used to hide multiple secrecy levels in a single image. In n level region incrementing visual cryptography scheme, image is divided in n regions. Each region consists of one level information. For implementing visual cryptography in n levels we need to encode (n+1) shares in such a way so that any single share is not able to show the information and ...
متن کامل